cartesian contour concis represent collect frequent set ruom jin yang xiang lin liu paper scheme refer cartesian contour concis repres collect frequent itemset exist work scheme complet view itemset cover entir collect interestingli take step deriv gener view frequent pattern formul small number pattern interact produc complex frequent itemset perform theoret investig concis represent problem link bicliqu set cover problem prove np hard develop approach util techniqu develop frequent itemset mine set cover max cover approxim minim bicliqu set cover problem addit heurist techniqu speedup construct cartesian contour detail experiment studi demonstr effect effici approach 